Localization of eigenvectors in random graphs
نویسندگان
چکیده
منابع مشابه
Eigenvectors of Random Graphs: Nodal Domains
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relatively little is known about the corresponding eigenvectors. Our main focus in this paper is on the nodal domains associated with the different eigenfunctions. In the analogous realm of Laplacians of Riemannian manifolds,...
متن کاملEntrywise Bounds for Eigenvectors of Random Graphs
Let G be a graph randomly selected from Gn,p, the space of Erdős-Rényi Random graphs with parameters n and p, where p > log 6 n n . Also, let A be the adjacency matrix of G, and v1 be the first eigenvector of A. We provide two short proofs of the following statement: For all i ∈ [n], for some constant c > 0
متن کاملSparse random graphs: Eigenvalues and eigenvectors
In this paper we prove the semi-circular law for the eigenvalues of regular random graph Gn,d in the case d→∞, complementing a previous result of McKay for fixed d. We also obtain a upper bound on the infinity norm of eigenvectors of Erdős-Rényi random graph G(n, p), answering a question raised by Dekel-Lee-Linial.
متن کاملIndependence Ratio and Random Eigenvectors in Transitive Graphs
1.1. The independence ratio and the minimum eigenvalue. An independent set is a set of vertices in a graph, no two of which are adjacent. The independence ratio of a graph G is the size of its largest independent set divided by the total number of vertices. If G is regular, then the independence ratio is at most 1/2, and it is equal to 1/2 if and only if G is bipartite. The adjacency matrix of ...
متن کاملOn Non-localization of Eigenvectors of High Girth Graphs
We prove improved bounds how localized an eigenvector of a high girth regular graph can be, and present examples showing that these bounds are close to sharp. This study was initiated by Brooks and Lindenstrauss [BL13] who relied on the observation that certain suitably normalized averaging operators on high girth graphs are hyper-contractive and can be used to approximate projectors onto the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2012
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2012-30338-1